An Enumerative Geometry for Magic and Magilatin Labellings

نویسنده

  • Matthias Beck
چکیده

A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Mathematics Subject Classifications (2000): Primary 05B15, 05C78; Secondary 05A15, 05B35, 52B20, 52C35, 52C07.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Magic labellings of graphs over finite abelian groups

A total labelling of a graph with v vertices and e edges is a one-to-one map taking the vertices and edges onto the set {1, 2, 3, . . . , v + e}. A labelling can be used to define a weight for each vertex and edge. For a vertex the weight is the sum of the label of the vertex and the labels of the incident edges. For an edge {x, y} the weight is the sum of the label of the edge and the labels o...

متن کامل

Magic labellings of infinite graphs over infinite groups

A total labelling of a graph over an abelian group is a bijection from the set of vertices and edges onto the set of group elements. A labelling can be used to define a weight for each edge and for each vertex of finite degree. A labelling is edge-magic if all the edges have the same weight and vertex-magic if all the vertices are finite degree and have the same weight. We exhibit magic labelli...

متن کامل

Group distance magic and antimagic graphs

Given a graph G with n vertices and an Abelian group A of order n, an A-distance antimagic labelling of G is a bijection from V (G) to A such that the vertices of G have pairwise distinct weights, where the weight of a vertex is the sum (under the operation of A) of the labels assigned to its neighbours. An A-distance magic labelling of G is a bijection from V (G) to A such that the weights of ...

متن کامل

Magic labellings of infinite graphs

There are many results on edge-magic, and vertex-magic, labellings of finite graphs. Here we consider magic labellings of countably infinite graphs over abelian groups. We also give an example of a finite connected graph that is edge-magic over one, but not over all, abelian groups of the appropriate order.

متن کامل

The maximum degree in a vertex-magic graph

where E(v) is the set of edges that have v as an end-point. The total labelling λ of G is vertex-magic if every vertex has the same weight, and the graph G is vertexmagic if a vertex-magic total labelling of G exists. Magic labellings of graphs were introduced by Sedlácěk [5] in 1963, and vertex-magic total labellings first appeared in 2002 in [4]. For a dynamic survey of various forms of graph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005